Primitivity of generalized circulant Boolean matrices
نویسندگان
چکیده
منابع مشابه
Lightweight MDS Generalized Circulant Matrices
In this article, we analyze the circulant structure of generalized circulant matrices to reduce the search space for finding lightweight MDS matrices. We first show that the implementation of circulant matrices can be serialized and can achieve similar area requirement and clock cycle performance as a serial-based implementation. By proving many new properties and equivalence classes for circul...
متن کاملLightweight MDS Generalized Circulant Matrices (Full Version)
In this article, we analyze the circulant structure of generalized circulant matrices to reduce the search space for finding lightweight MDS matrices. We first show that the implementation of circulant matrices can be serialized and can achieve similar area requirement and clock cycle performance as a serial-based implementation. By proving many new properties and equivalence classes for circul...
متن کاملGeneralized hyperbolic functions, circulant matrices and functional equations
There is a contrast between the two sets of functional equations f0(x + y) = f0(x)f0(y) + f1(x)f1(y), f1(x + y) = f1(x)f0(y) + f0(x)f1(y), and f0(x − y) = f0(x)f0(y)− f1(x)f1(y), f1(x − y) = f1(x)f0(y)− f0(x)f1(y) satisfied by the even and odd components of a solution of f(x + y) = f(x)f(y). J. Schwaiger and, later, W. Förg-Rob and J. Schwaiger considered the extension of these ideas to the cas...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملApplication of Circulant Matrices
A k x k matrix A = [aU lover a field F is called circulant if aij = a (j-i) mod k' A [2k ,k l linear code over F = GF (q) is called double-circulant if it is generated by a matrix of the fonn [I A l, where A is a circulant matrix. In this work we ftrst employ the Fourier transform techJ nique to analyze and construct se:veral families of double-circulant codes. The minimum distance of the resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1996
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)00084-0